Team-Maxmin Equilibria
نویسندگان
چکیده
In a noncooperative game, a team is a set of players that have identical payoffs. We investigate zero-sum games where a team of several players plays against a single adversary. The team is not regarded as a single player because the team members might not be able to coordinate their actions. In such a game, a certain equilibrium can be selected naturally: the team-maxmin equilibrium. It assures the team players the best payoff they can hope for, given their inability to coordinate. A team-maxmin equilibrium exists, and in a generic game it is unique. Journal of Economic Literature Classification Number: C72. Q 1997 Academic Press
منابع مشابه
Team-Maxmin Equilibrium: Efficiency Bounds and Algorithms
The Team-maxmin equilibrium prescribes the optimal strategies for a team of rational players sharing the same goal and without the capability of correlating their strategies in strategic games against an adversary. This solution concept can capture situations in which an agent controls multiple resources—corresponding to the team members—that cannot communicate. It is known that such equilibriu...
متن کاملBayesian Games on a Maxmin Network Router
In this paper, we consider network games with incomplete information. In particular, we apply a game-theoretic network model to analyze Bayesian games on a MaxMin router. The results show that the MaxMin mechanism induces desirable Nash equilibria.
متن کاملComputing the Team-maxmin Equilibrium in Single-Team Single-Adversary Team Games
A team game is a non–cooperative normal–form game in which some teams of players play against others. Team members share a common goal but, due to some constraints, they cannot act jointly. A real–world example is the protection of environments or complex infrastructures by different security agencies: they all protect the area with valuable targets but they have to act individually since they ...
متن کاملA Theory of Convergence Order of Maxmin Rate Allocation and an Optimal Protocol
The problem of allocating maxmin rates with minimum rate constraints for connection-oriented networks is considered. This paper proves that the convergence of maxmin rate allocation satisfies a partial ordering in the bottleneck links. This partial ordering leads to a tighter lower bound for the convergence time for any maxmin protocol. An optimally fast maxmin rate allocation protocol called t...
متن کاملMaxmin Weighted Expected Utility: A Simpler Characterization∗
Chateauneuf and Faro [3] axiomatize a weighted version of maxmin expected utility over acts with nonnegative utilities, where weights are represented by a confidence function. We argue that their representation is only one of many possible, and we axiomatize a more natural form of maxmin weighted expected utility. We also provide stronger uniqueness results.
متن کامل